Complex Interpolating Polynomials
نویسندگان
چکیده
منابع مشابه
Interpolating polynomials and divided differences
We shall take it as known that a polynomial of degree n has at most n distinct zeros (a proof is given in Lemma 1 below). Given n+1 distinct real numbers xj and any numbers αj (0 ≤ j ≤ n), there is a unique polynomial p of degree at most n satisfying p(xj) = αj (0 ≤ j ≤ n). The polynomial is unique, since if p1 and p2 were two such polynomials, then p1−p2 would be zero at each xj: since it has ...
متن کاملInterpolating Polynomials from Their Values
A fundamental technique used by many algorithms in computer algebra is interpolating polynomials from their values. This paper discusses two algorithms for-solving this problem for sparse multivariate polynomials, anupdated version of a probabilistic one and a new deterministic techniqo" that uses some ideas due to Ben-Or and Tiwari (1988). In addition algorithms are presented for quickly findi...
متن کاملOn Interpolating Polynomials over Finite Fields
A set of monomials x a 0 ; : : : ; x ar is called interpolating with respect to a subset S of the nite eld F q , if it has the property that given any pairwise diierent elements x 0 ; : : : ; x r in S and any set of elements y 0 ; : : :; y r in F q there are elements c 0 ; : : :; c r in F q such that y h = P r j=0 c j x a j h for 0 h r. In this paper we address the question of determining inter...
متن کاملEfficient Basis Change and Regularization for Sparse-grid Interpolating Polynomials
Sparse-grid interpolation provides good approximations to smooth functions in high dimensions based on relatively few function evaluations, but in standard form is expressed in Lagrange polynomials and requires function values at all points of a sparse grid. Here we give a block-diagonal factorization of the matrix for changing basis from a Lagrange polynomial formulation of a sparse-grid inter...
متن کاملSolving multi-choice linear programming problems by interpolating polynomials
Multi-choice programming solves some optimization problems where multiple information exists for a parameter. The aim of this paper is to select an appropriate parameter from a set of multiple choices, which optimizes the objective function. We consider a linear programming problem where the right hand side parameters are multi-choice in nature. In this paper, the multiple choices of a paramete...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the American Mathematical Society
سال: 1988
ISSN: 0002-9939
DOI: 10.2307/2047538